Some graph properties determined by edge zeta functions
نویسنده
چکیده
Stark and Terras introduced the edge zeta function of a finite graph in 1996. The edge zeta function is the reciprocal of a polynomial in twice as many variables as edges in the graph and can be computed in polynomial time. We look at graph properties which we can determine using the edge zeta function. In particular, the edge zeta function is enough to deduce the clique number, the number of Hamiltonian cycles, and whether a graph is perfect or chordal. Actually computing these properties takes exponential time. Finally, we present a new example illustrating that the Ihara zeta function cannot necessarily do the same.
منابع مشابه
Zeta Functions and Chaos
This paper is an expanded version of lectures given at M.S.R.I. in June of 2008. It provides an introduction to various zeta functions emphasizing zeta functions of a finite graph and connections with random matrix theory and quantum chaos. Section 2. Three Zeta Functions For the number theorist, most zeta functions are multiplicative generating functions for something like primes (or prime ide...
متن کاملProperties Determined by the Ihara Zeta Function of a Graph
In this paper, we show how to determine several properties of a finite graph G from its Ihara zeta function ZG(u). If G is connected and has minimal degree at least 2, we show how to calculate the number of vertices of G. To do so we use a result of Bass, and in the case that G is nonbipartite, we give an elementary proof of Bass’ result. We further show how to determine whether G is regular, a...
متن کاملCERTAIN TYPES OF EDGE m-POLAR FUZZY GRAPHS
In this research paper, we present a novel frame work for handling $m$-polar information by combining the theory of $m-$polar fuzzy sets with graphs. We introduce certain types of edge regular $m-$polar fuzzy graphs and edge irregular $m-$polar fuzzy graphs. We describe some useful properties of edge regular, strongly edge irregular and strongly edge totally irregular $m-$polar fuzzy graphs. W...
متن کاملOn the signed Roman edge k-domination in graphs
Let $kgeq 1$ be an integer, and $G=(V,E)$ be a finite and simplegraph. The closed neighborhood $N_G[e]$ of an edge $e$ in a graph$G$ is the set consisting of $e$ and all edges having a commonend-vertex with $e$. A signed Roman edge $k$-dominating function(SREkDF) on a graph $G$ is a function $f:E rightarrow{-1,1,2}$ satisfying the conditions that (i) for every edge $e$of $G$, $sum _{xin N[e]} f...
متن کاملEdge Reconstruction of the Ihara Zeta Function
We show that if a graph G has average degree d ≥ 4, then the Ihara zeta function of G is edge-reconstructible. We prove some general spectral properties of the Bass–Hashimoto edge adjancency operator T : it is symmetric on a Kreı̆n space and has a “large” semi-simple part (but it can fail to be semi-simple in general). We prove that this implies that if d > 4, one can reconstruct the number of n...
متن کامل